Burst error-correcting quantum stabilizer codes designed from idempotents

نویسندگان

چکیده

Abstract Certain classical codes can be viewed isomorphically as ideals of group algebras, while studying their algebraic structures help extracting the code properties. Research has shown that this was remarkably efficient in case when generators are idempotents. In quantum error correction, theory stabilizer formalism requires self-orthogonal additive over finite field GF (4), which, via lens essentially $$F_2$$ F 2 -submodules (4). Therefore, paper provides a classification on idempotents commutative algebra (4) G , followed by criterion allows to generate subgroups. Later, construction is done cyclic $$C_n$$ C n for $$n=2^m-1$$ = m - 1 and $$n=2^m+1$$ + . Quantum bounds burst minimum distance subsequently determined.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CSE 599d - Quantum Computing Stabilizer Quantum Error Correcting Codes

In the last lecture we learned of the quantum error correcting criteria and we discussed how it was possible for us to digitize quantum errors. But we didn’t talk about any concrete codes, the talk was in many ways very existential on these things called quantum error correcting codes. Of course we saw in Shor’s code that such codes could exist for single qubit errors. In this lecture we will i...

متن کامل

Quantum Error Correcting Codes

This thesis deals with quantum error correcting codes. In first two chapters necessary introduction to quantum computation and classical error correction is presented. Previous results on construction of quantum error correcting codes are presented in the third and fourth chapter. Mainly Calderbank-Steane-Shor (CSS) codes and stabilizer codes are discussed together with the introduction to codi...

متن کامل

Quantum Error-correcting Codes

These notes are a record of proceedings in the QMW Combinat-orics Study Group in November and December 1998. Since we are discrete mathematicians and know little quantum theory, the notes are not strong on the physics background (but we give references to several sources for this). We have tried to compare quantum with classical error correction where possible, and to provide enough information...

متن کامل

Quantum Error-Correcting Codes

Markus GRASSL received his diploma degree in Computer Science in 1994 and his doctoral degree in 2001, both from the Fakultät für Informatik, Universität Karlsruhe (TH), Germany. From 1994 to 2007 he was a member of the Institut für Algorithmen und Kognitive Systeme, Fakultät für Informatik, Universität Karlsruhe (TH), Germany. From 2007 to 2008 he was with the Institute for Quantum Optics and ...

متن کامل

One-point Goppa Codes on Some Genus 3 Curves with Applications in Quantum Error-Correcting Codes

We investigate one-point algebraic geometric codes CL(D, G) associated to maximal curves recently characterized by Tafazolian and Torres given by the affine equation yl = f(x), where f(x) is a separable polynomial of degree r relatively prime to l. We mainly focus on the curve y4 = x3 +x and Picard curves given by the equations y3 = x4-x and y3 = x4 -1. As a result, we obtain exact value of min...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Quantum Information Processing

سال: 2023

ISSN: ['1573-1332', '1570-0755']

DOI: https://doi.org/10.1007/s11128-023-03904-7